Higher order extension of Löwner’s theory: Operator $k$-tone functions
نویسندگان
چکیده
منابع مشابه
Extension of Higher Order Derivatives of Lyapunov Functions in Stability Analysis of Nonlinear Systems
The Lyapunov stability method is the most popular and applicable stability analysis tool of nonlinear dynamic systems. However, there are some bottlenecks in the Lyapunov method, such as need for negative definiteness of the Lyapunov function derivative in the direction of the system’s solutions. In this paper, we develop a new theorem to dispense the need for negative definite-ness of Lyapunov...
متن کاملHigher order close-to-convex functions associated with Attiya-Srivastava operator
In this paper, we introduce a new class$T_{k}^{s,a}[A,B,alpha ,beta ]$ of analytic functions by using a newly defined convolution operator. This class contains many known classes of analytic and univalent functions as special cases. We derived some interesting results including inclusion relationships, a radius problem and sharp coefficient bound for this class.
متن کاملhigher order close-to-convex functions associated with attiya-srivastava operator
in this paper, we introduce a new class$t_{k}^{s,a}[a,b,alpha ,beta ]$ of analytic functions by using a newly defined convolution operator. this class contains many known classes of analytic and univalent functions as special cases. we derived some interesting results including inclusion relationships, a radius problem and sharp coefficient bound for this class.
متن کاملHigher-order Operator Precedence Languages
Floyd’s Operator Precedence (OP) languages are a deterministic context-free family having many desirable properties. They are locally and parallely parsable, and languages having a compatible structure are closed under Boolean operations, concatenation and star; they properly include the family of Visibly Pushdown (or Input Driven) languages. OP languages are based on three relations between an...
متن کاملBi-tone and k-tone decompositions of Boolean functions
For a Boolean Matrix A a binary vector v is called tfrequent if Av has at least t entries of value supp (v). Given two parameters t1 < t2 the t1-frequent but t2-infrequent vectors of a matrix represent a Boolean function that has two domains of (opposite) monotonicity. These functions were studied for the purpose of data analysis and abstract concept discovery in (Eisenschmidt et al. 2010). In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2014
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-2014-05942-4